Multicast-based inference of temporal loss characteristics in packet data networks

ABSTRACT

Disclosed are method and apparatus for characterizing the temporal loss characteristics of a packet data network by multicast-based inference. Multicast probes are transmitted from a source node to a plurality of receiver nodes, which record the arrivals of the multicast probes. From the aggregate data comprising recorded arrivals of the end-to-end paths from the source node to each receiver node, temporal loss characteristics of individual links within the network may be calculated. In a network with a tree topology, the complexity of calculations may be reduced through a process of subtree partitioning.

This patent arises from a continuation of U.S. patent application Ser. No. 11/903,169 (now U.S. Pat. No. 8,233,402) filed on Sep. 20,2007, the disclosure of which is incorporated herein by reference in its entirety.

CROSS-REFERENCE TO RELATED APPLICATION

This patent is related to U.S. patent application Ser. No. 11/903,158, entitled Multicast-Based Inference of Temporal Delay Characteristics in Packet Data Networks, which was filed on Jun. 27, 2010 and which is incorporated herein by reference in its entirety.

BACKGROUND OF THE INVENTION

The present invention relates generally to network characterization of packet loss, and more particularly to network characterization of packet loss by multicast-based inference.

Packet data networks, such as Internet Protocol (IP) networks, were originally designed to transport basic data in a packetized format. Increasingly, however, other services, such as voice over IP (VoIP) and video on demand (VOD), are utilizing packet data networks. These services, in general, have more stringent requirements for network quality of service (QoS) than basic data transport. Depending on the application, QoS is characterized by different parameters. An important one is packet loss. For example, in some data transport protocols such as TCP, packets which are lost are re-transmitted. Services such as VoIP, however, operate in real time (or, at least, near-real time). Lost packets typically are not re-transmitted, and an excessive number of lost packets will result in poor voice quality. Even if only data is being transported, competing services using the same transport network may have different QoS requirements. For example, near-real time system control will have more stringent loss requirements than download of music files. In some instances, QoS requirements are set by service level agreements between a network provider and a customer.

Measurement of various network parameters is essential for network planning, architecture, administration, and diagnostics. Some parameters may be measured directly by network equipment, such as routers and switches. Since different network providers typically do not share this information with other network providers and with end users, however, system-wide information is generally not available to a single entity. Additionally, the measurement capabilities of a piece of network equipment are typically dependent on proprietary network operation systems of equipment manufacturers. The limitations of internal network measurements are especially pronounced in the public Internet, which comprises a multitude of public and private networks, often stitched together in a haphazard fashion.

A more general approach to network characterization, therefore, needs to be independent of measurements captured by equipment internal to the transport network. That is, the measurements need to be performed by user-controlled hosts attached to the network. One approach is for one host to send a test message to another host to characterize the network link between them. A standard message widely utilized in IP networks is a “ping”. Host A sends a ping to Host B. Assuming that Host B is operational, if the network connection between Host A and Host B is operational, then Host A will receive a reply message from Host B. If Host A does not receive a reply within a user-defined timeout interval, it declares the message to have been lost. Pings are examples of point-to-point messages between two hosts. As the number of hosts connected to the network increases, the number of point-to-point test messages increases to the level at which they are difficult to administer. They may also produce a significant load on both the hosts and the transport network. A key requirement of any test tool is that it must not corrupt the system under test. In addition to the above limitations, in some instances, pings may not provide the level of network characterization required for adequate network planning, architecture, administration, and diagnostics.

What is needed is a network characterization tool which provides detailed parameters on the network, runs on hosts controlled by end users, and has minimal disturbance on the operations of the hosts and transport network.

BRIEF SUMMARY OF THE INVENTION

Temporal loss characteristics in packet data networks are characterized by multicast-based inference. A packet data network comprises a set of nodes connected by a set of paths. Each path may comprise a set of individual links. In multicast-based inference, multiple test messages (probes) are multicast from a source node to a set of receiver nodes. Each individual receiver node records the arrivals of the probes transmitted along an end-to-end path from the source node to the individual receiver node. From the aggregate arrival data collected by the set of receiver nodes, temporal loss characteristics of individual links may be calculated. In addition to average loss per unit time, temporal characteristics comprise parameters such as number of consecutive losses and number of consecutive successful transmissions. In embodiments in which the topology of the packet data networks is a tree, calculations may be simplified by a process of subtree partitioning.

These and other advantages of the invention will be apparent to those of ordinary skill in the art by reference to the following detailed description and the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a schematic of a packet data communications system;

FIG. 2 shows a schematic of a tree topology of a network;

FIG. 3 shows a schematic of a network test architecture;

FIG. 4 shows a flow chart of a multicast-based temporal link loss network characterization process;

FIG. 5 is a schematic for subtree partitioning of a binary tree;

FIG. 6 is a schematic for subtree partitioning of an arbitrary tree; and,

FIG. 7 is a schematic of a computer for performing a multicast-based network characterization process.

DETAILED DESCRIPTION

FIG. 1 shows a network architecture schematic of an example of a communications system comprising packet data network 102 and end-user nodes 104-110. Within packet data network 102 are edge nodes 112-118 and intermediate nodes 120 and 122. An edge node connects an end-user node to a packet data network. An intermediate node connects nodes within a network. In some instances, a node may serve as both an edge node and an intermediate node. Herein, an edge node and an intermediate node are considered to be logically equivalent, and “intermediate nodes” comprise both intermediate nodes and edge nodes. Herein, “nodes” comprise both physical nodes and logical nodes. An example of a physical end-user node is a host computer. An example of a logical end-user node is a local area network. An example of a physical intermediate node is a router. An example of a logical intermediate node is a subnetwork of routers, switches, and servers. In all instances, an end user may access and control an end-user node. Access and control policies for an intermediate node, however, are set by a network provider, which, in general, is a different entity from an end user. In general, an end user may not have permission to access and control an intermediate node.

Nodes are connected via network links, which comprise physical links and logical links. In FIG. 1, links 124-140 represent physical links. Examples of physical links include copper cables and optical fiber. Links 142 and 144 represent logical links. For example, logical link 142 represents an end-to-end network link along which data is transmitted between end-user node 106 and end-user node 104. Logical link 142 comprises physical links 126, 134, 132, and 124. A logical link may further comprise segments which are also logical links. For example, if intermediate node 114 is a router, there is both a physical link for signal transport across the router and a logical link for data transport across the router. Logical links may span multiple combinations of end-user nodes and intermediate nodes. Logical links may span multiple networks. Since a physical link may also be considered a logical link, a network link may also be referred to herein simply as a “link”. Herein, an end-to-end network link connecting one node to another node may also be referred to as a “path”. A path may comprise multiple links.

In an embodiment, characterization of packet data network 102 is performed by multicasting test messages from a source node (for example, end-user node 106) to receiver nodes (for example, end-user nodes 104, 108, and 110). Analysis of the test messages transmitted from source node 106 and received by a specific receiver node (for example, node 104) yields characteristics of the path from the source node 106 to the specific receiver node 104. In addition, test messages received at all the receiver nodes may be aggregated to infer characteristics of internal network links. For example, in FIG. 1, test messages transmitted from the source node 106 to receiver nodes 104, 108, and 110 all must pass through the common network link defined by (link 126-node 114-link 134-node 120). Thus, if test messages are received at any one of the receiver nodes 104, 108, and 110, then source 106, link 126, node 114, link 134, and node 120 are all operational. (The assumption here is that if a node is operational for one link passing through it, it is operational for all links passing through it. In some instances, this assumption may not hold.) If receiver node 108 receives the test messages, but receiver node 104 does not, then it can be inferred that transmission failed along the network link defined by (link 132-node 112-link 124).

The process of characterizing a packet data network by multicasting test messages from a source node and analyzing the aggregate of test messages received by multiple receiver nodes is referred to herein as “multicast-based inference of network characteristics (MINC)”. Previous applications of MINC characterized average packet loss. See, for example, R. Caceres et al., “Multicast-Based Inference of Network-Internal Loss Characteristics,” IEEE Transactions in Information Theory, vol. 45, pp. 26-45, 2002. (Herein, “packet loss” will be referred to simply as “loss”.) Average loss, however, provides only coarse characterization of network loss characteristics. It is well known, for example, that packet data networks are susceptible to noise (for example, electromagnetic interference), which may cause packets to be lost. Losses may be much greater during a noise burst than during quasi-quiet periods. It is also well known, for example, that traffic in packet data networks is bursty. Traffic congestion may cause packets to be lost. Losses may be much greater during heavy traffic load than during light traffic load. Simple average values of loss, therefore, do not adequately capture network characteristics. Advantageous procedures for MINC described herein expand the range of network characterization to include temporal loss characteristics of packet data networks. Herein, “temporal loss characteristics” refer to patterns of network loss as a function of time. Examples of temporal loss characteristics are discussed below.

Advantageous procedures for MINC are illustrated herein for packet data networks with a tree topology. FIG. 2 shows a graphical representation of a network viewed as a logical multicast tree T 200 comprising a set V of nodes 202-216, V={0, k, b-g}, and a set L of links 218-230, L={link k, link b-link g}. In the tree model, node 0 202 is the root node; node k 204, node b 206, and node c 208 are branch nodes; and node d 210-node g 216 are leaf nodes. Herein, a branch node in a tree model, as illustrated in FIG. 2, is equivalent to an intermediate node in a network architecture model, as illustrated in FIG. 1. Herein, the following genealogical terminology is also used:

Node k 204 is a “child” of root node 0 202; node b 206 and node c 208 are “children” of node k 204; node d 210 and node e 212 are children of node b 206; and node f 214 and node g 216 are children of node c 208. Other examples of genealogical terminology used herein include: node b 206 is the “father” of node d 210; and node b 206, node k 204, and root node 0 202 are all “ancestors” of node d 210.

In the tree model illustrated in FIG. 2, the network topology is known to the end user. One skilled in the art may develop other embodiments which apply to networks in which the network topology is not a priori known to the end user. See, for example, N. G. Duffield et al., “Multicast Topology Inference from Measured End-to-End Loss,” IEEE Transactions in Information Theory, vol. 48, pp. 26-45, 2002. In a tree model, a non-root node node l receives messages from one and only one node, referred to as the unique father node f(l) of node l. One skilled in the art may develop other embodiments to characterize networks in which a specific node may have more than one father node. See, for example, T. Bu et al., “Network Tomography on General Topologies,” Proceedings ACM Sigmetrics 2002, Marina Del Rey, C A, Jun. 15-19, 2002.

In MINC, test messages are multicast from a single source node to multiple destination nodes, which are the receiver nodes under test. In FIG. 2, the single source node is root node 0 202, and the destination nodes are leaf nodes node d 210-node g 216. An end user has access to, and control of, source and receiver nodes. Herein, “test messages” may also be referred to as “probe messages”. To simplify the terminology further, “probe messages” may also be referred to as “probes”. In a multicast transmission, a probe is replicated at branch nodes. Separate copies are then forwarded to other branch nodes and to the destination nodes. In an example, packet data network 102 comprises an Internet Protocol (IP) network. A probe comprises one or more packets in which the source IP address is that of source node root node 0 202, and the destination IP addresses are those of leaf nodes node d 210-node g 216. Typically, the IP addresses of node d 210-node g 216 are defined elements in a multicast group, which, for example, may be a range of addresses in a multicast subnet.

As shown in FIG. 2, probe i 232, where i is an integer 1, 2, 3 . . . , is transmitted from the source node root node 0 202 to branch node node k 204, which then transmits a copy of the probe, shown in the figure as 234, to branch node node b 206. Branch node node k 204 transmits another copy of the probe, shown in the figure as 238, to branch node node c 208. Herein, the term “probe” comprises both the original probe transmitted from the source node root node 0 202, and copies of the probe transmitted to branch nodes and destination nodes. The network parameter under test is loss (within a specified time interval). In FIG. 2, probes which are successfully transmitted are indicated as circles, 232-240. Probes which are lost are indicated as squares, 242 and 244. In this example, the probe reaches branch nodes, node k 204, node b 206, and node c 208. The probe further reaches destination nodes, node d 210 and node f 214; but the probe does not reach destination nodes, node e 212 and node g 216. A series of probes is used to measure the time dependence of network parameters. Note that the time interval between consecutive probes does not need to be constant. Herein, in measurements of loss, a destination node records (also referred to as “observes”) the “arrival” of a probe message. If a probe message does not arrive at a destination node within a user-defined interval, the destination node declares the probe message to be lost.

When the network parameter under test is loss, the multicast process is characterized by node states and link processes. The source node root node 0 202 transmits a discrete series of probes probe i, where the index i is an integer 1, 2, 3 . . . The node state X_(l)(i) indicates whether probe i has arrived at node l. The value X_(l)(i)=1 indicates that probe i has arrived at node l. The value X_(l)(i)=0 indicates that probe i has not arrived at node l, and has therefore been lost. In FIG. 2, probe i successfully arrived at node k 204-node d 210, and node f 214. The probe did not arrive at node e 212 and node g 216. Therefore, X_(k)(i)=X_(b)(i)=X_(c)(i)=X_(d)(i)=X_(f)(i)=1; and X_(e)(i)=X_(g)(i)=0.

The link process Z_(l)(i) indicates whether link l is capable of transmission during the interval in which probe i would attempt to reach node l, assuming that probe i were present at the father node f(l). The value Z_(l)(i)=1 indicates that the link is capable of transmission. The value Z_(l)(i)=0 indicates that the link is not capable of transmission. If node R is a destination node which is a receiver node under test, then X_(R)(i) provides loss statistics on the end-to-end path connecting source node root node 0 to node R. The aggregate data collected from a set of receiver nodes {node R} characterizes the set of end-to-end paths from source node root node 0 to each receiver node. In one procedure, MINC analyzes aggregate data to infer temporal characteristics of loss processes determining the link processes Z_(l)={Z_(l)(i)} along individual links internal to the network. Examples of model link loss processes Z_(l)={Z_(l)(i)} include Bernoulli, On-Off, and Stationary Ergodic Markov Process of Order r.

An example of a MINC process, in which the parameter under test is loss, is illustrated in FIG. 3 and described in the corresponding flow chart shown in FIG. 4. FIG. 3 shows a network schematic of a communications system comprising packet data network 302, source root node 0 304, and destination nodes node d 306-node g 312. The circle 314 represents a probe. In the simple example described in the flow chart shown in FIG. 4, a series of four probes are multicast from source root node 0 304 to destination nodes node d 306-node g 312. In actual test runs, the number of probes is much greater than 4. A test run may comprise 10,000 probes, for example.

In step 402, the probe index i is initialized to 1. In step 404, source root node 0 304 multicasts probe i 314 to destination nodes node d 306-node g 312. In step 406, each individual destination node, node d 306-node g collects data from probe i 314. In this instance, the data comprises records (observations) of whether the probe has arrived at a destination node.

The data is collected in a database which may be programmed in source root node 0 304, destination nodes node d 306-node g 312, or on a separate host which may communicate with root node 0 304 and destination nodes node d 306-node g 312. In step 408, the probe index i is incremented by 1. In step 410, the process returns to step 404, and steps 404-408 are iterated until four probes have been multicast. The process then continues to step 412, in which the probe data is outputted. In step 414, temporal link-loss characteristics of packet data network 402 are inferred from the probe data outputted in step 412. Details of the inference process are discussed below.

An example of data outputted in step 412 is shown in table 412A, which comprises columns (col.) 416-424 and rows 426-434. In row 426, the column headings indicate probe index i col. 416 and destination nodes node d col. 418-node g col. 424. Column 416, rows 428-434, tracks the probes, probe i, i=1−4. The entries in rows 428-434, col. 418-424, track the set of node states X_(l)={X_(l)(i)}, where l=d-g and i=1-4. A node state has the value 1 if the probe arrived (was received), and the value 0 if the probe was lost (was not received).

The process illustrated in the flow chart shown in FIG. 4 is a discrete time loss model with the following loss dependence structure:

-   -   Spatial. A loss process on one link is independent of the loss         process on any other link.     -   Temporal. In previous applications of MINC, a loss process         within a single link is independent of time. In advantageous         procedures described herein, this constraint is removed, and a         larger range of network characteristics may be analyzed. A loss         process on any link (except for the link starting from the root         node 0) is stationary and ergodic. That is, within a link,         packet losses may be correlated, with parameters that in general         depend on the link.         In examples discussed herein, the temporal characteristics under         test comprise measurements of “pass-runs” and “loss-runs” across         a link within packet data network 302. Herein, a “pass” refers         to a probe which has been successfully transmitted across a link         and arrives at a destination node. A “loss” refers to a probe         which has been lost during transmission across a link. A         “pass-run” refers to a consecutive sequence of passes delimited         by a loss before the first pass of the pass-run and a loss after         the last pass of the pass-run. Similarly, a “loss-run” refers to         a consecutive sequence of losses delimited by a pass before the         first loss of the loss-run and a pass after the last loss of the         loss-run. As an example, the following sequential data may be         collected: a pass-run of 5,000 probes; a loss-run of 2000         probes; a pass-run of 50,000 probes; and a loss-run of 100         probes.

As discussed above, average loss (in a specified time interval) does not provide adequate characterization of links. Examples of more detailed temporal loss characteristics of a link include the mean length of a pass-run, the mean length of a loss-run, and the probability that the length of a pass-run or loss-run exceeds a specific value. As discussed above, advantageous procedures process the aggregate data recorded (collected) from probes received at the destination nodes to estimate the link-loss parameters of interest for individual links within the network. As discussed above, a “path” is an end-to-end network link connecting one node to another node. A path may comprise multiple links. Herein, “path passage” refers to successful transmission of a probe across a path. Herein, “link passage” refers to successful transmission of a probe across a link. Individual link passage characteristics are inferred from path passage characteristics. Below, a system of equations describing path passage characteristics as functions of link passage characteristics is first derived. The path passage characteristics are values which are calculated from the aggregate data. Solutions to the system of equations then yield the link passage characteristics. In some instances, the solutions are approximate, and the approximate solutions yield estimates of the link passage characteristics.

As an example, let P_(k) be a random variable taking the marginal distribution of a pass-run, then the mean pass-run length is:

$\begin{matrix} {{{E\left\lbrack P_{k} \right\rbrack} = {{\sum\limits_{j \geq 1}\;{j\;{\Pr\left\lbrack {P_{k} = j} \right\rbrack}}} = {{\sum\limits_{j \geq 1}\;{\Pr\left\lbrack {P_{k} \geq j} \right\rbrack}} = \frac{\Pr\left\lbrack {{Z_{k}(1)} = 1} \right\rbrack}{{\Pr\left\lbrack {{Z_{k}(1)} = 1} \right\rbrack} - {\Pr\left\lbrack {{{Z_{k}(0)} = 1},{{Z_{k}(1)} = 1}} \right\rbrack}}}}},} & \left( {{Eqn}\mspace{14mu} 1} \right) \end{matrix}$

-   -   where E[.] means expected value and Pr[.] means probability of         [.]         Similarly, values such as mean loss-run length, probability that         a pass-run is greater than a specified value, and probability         that a loss-run is greater than a specified value may be         calculated.

Methods to estimate parameters of interest are described herein. The following parameters and functions are defined herein: I={i ₁ ,i ₂, . . . i_(s)}, where s is an integer, s≧1,  (Eqn 2)

-   -   is a set of time indices at which probes are transmitted. It is         a generalization of a simple sequence i=1, 2, 3 . . . . That is,         the time indices do not need to be equally spaced or even         contiguous.     -   For example, data may be collected from probe 7, probe 10, and         probe 27.     -   x_(l)(I) is a pattern of probes, corresponding to the index set         I,     -   which survived to node l.         x _(l)(I)={{X _(l)(i)}:X _(l)(i₁)=X _(l)(i ₂)= . . . X_(l)(i         _(s))=1}  (Eqn 3)     -   z_(l)(I) is a link passage mask, defined such that probes with         indices in I, if present at node f(l), will pass to node l,         where node f(l) is the father of node l.         z _(l)(I)={{Z _(l)(i)}:Z _(l)(i₁)=Z _(l)(i ₂)= . . . Z_(l)(i         _(s))=1}  (Eqn 4)     -   Link pattern passage probability is defined by         α_(l)(I)=Pr[z _(l)(I)]=Pr[x _(l)(I)|x _(f(l))(I)]  (Eqn 5)     -   That is, if a probe has reached the father node node f(l), α_(l)         is the probability that the probe will reach node l across link         l.     -   Path pattern probability is defined by         _(l)(I)=Pr[x _(l)(I)]=α_(l)(I)         _(f(l))(I)  (Eqn 6)

That is,

is the probability that the probe has successfully reached node l across the full path from root node to node l.

In this instance, the path pattern probability is equal to the product of the link pattern probabilities of the individual links from root node 0 to node l:

$\begin{matrix} {{{??}_{l}(I)} = {\prod\limits_{w \in {a{(l)}}}\;{\alpha_{w}(I)}}} & \left( {{Eqn}\mspace{14mu} 7} \right) \end{matrix}$

where α(l) is the set of ancestors of node l.

An example is discussed with respect to the tree model previously shown in FIG. 2. The source node is root node 0 202. The source node multicasts a sequence of four probes. In Eqn 2, I={i₁−1, i₂=2, i₃=3, i₄=4}. The receiver nodes which collect the probes are the destination leaf nodes, node d 210-node g 216. Consider node I=node b C06. In Eqn 4 and Eqn 5, the father node node f(b) of node b 206 is node k C04. In Eqn 7, the set of ancestors of node b 206 is a(b)={node k 204, node 0 202}.

Assume that probe 1-probe 4 all arrive at node k 204. Then, in Eqn 3, x_(k)(I)={X_(k)(1)=X_(k)(2)=X_(k)(3)=X_(k)(4)=1}. Further assume that probe 1, probe 2, and probe 3 all arrive at node b 206, but probe 4 is lost. In this instance, in Eqn 4, z_(b)(I)={Z_(b)(1)=Z_(b)(2)=Z_(b)(3)=1}, and, at node b 206, x_(b)(I)={X_(b)(1)=X_(b)(2)=X_(b)(3)=1}. In Eqn 5, the link pattern passage probability is α_(b)(I)=Pr[z_(b)(I)]=Pr[x_(b)(I)|x_(k)(I)]. Or, in terms of this simple example, if probe 1 arrives at node k 204, the probability of probe 1 arriving at node b is equal to the probability that the link passage probability across link b 220 is 1. A similar analysis applies for the other probes and other nodes.

In Eqn 7, now consider node l=node d 210, one of the receiver nodes which collects data. The set of ancestors of node d, denoted above as a(d) in Eqn 7, comprises {node b 206, node k 204, root node 0 202}. For a probe probe i, the probability of path passage

_(d)(i) from root node 0 202 to receiver node d 210 is equal to the product of the probability of link passage across link k 218×the probability of link passage across link b 220× the probability of link passage across link d 222. A similar analysis holds for the other receiver nodes, node e 212-node g 216. A goal of MINC is to use the data collected at receiver nodes, node d 210-node g 216, to estimate the link passage probabilities across individual links, link k 218-link g 230. In a more generalized example, a goal is to estimate the link pattern passage probability α_(l)(I) of arbitrary patterns for all internal links l. These can be extracted from Eqn. 6 if

is known for all l, l≠0. In general, solving a polynomial equation of order >1 is required.

In an embodiment, path passage probabilities are calculated as a function of link passage probabilities by a process of subtree partitioning, which results in lower order polynomial equations. Since, in general, lower order polynomial equations are easier to solve than higher order polynomial equations, subtree partitioning is advantageous. For example, subtree partitioning may result in a linear equation instead of a quadratic equation. The underlying concept of subtree partitioning is illustrated for a binary tree in the example shown in FIG. 5. In the binary tree T 500, each branch node has two child nodes. Here, probes are multicast from a source node S 502 to branch node node k 504. Tree T 500 is partitioned into two subtrees, subtree T_(k,l) 506 and subtree T_(k,2) 508. Branch node node k 504 in tree T 500 is configured as the root node for each of the two subtrees, T_(k,1) 506 and T_(k,2) 508. Node k 504 has two child nodes, node d_(1,1), 510 and node d_(1,2) 512. Each child node has two child nodes of its own. Node d_(1,1) 510 is a branch node in subtree T_(k,1) 506, and node d_(1,2) 512 is a branch node in subtree T_(k,2) 508. In turn, branch node node d_(1,1) 510 has two child nodes, node R_(1,1) 514 and node R_(2,1) 516. Similarly, branch node node d_(1,2) 512 has two child nodes, node R_(1,2) 518 and node R_(2,2) 520. Here, node R_(1,1) 514, node R_(2,1) 516, node R_(1,2) 518 and node R_(2,2) 520 are receiver nodes which receive probes from source node S 502.

In an example for a binary tree with subtree partitioning, path passage probabilities are calculated as follows. The following parameters and functions are defined herein.

$\begin{matrix} {{{Y_{k,c}(i)} = {\underset{j \in R_{k,c}}{⩔}{X_{j}(i)}}},{{{for}\mspace{14mu} c} = \left\{ {1,2} \right\}},{{{where}\mspace{14mu} c} = {1\mspace{14mu}{is}\mspace{14mu}{subtree}\mspace{14mu} 1}},} & \left( {{Eqn}\mspace{14mu} 8} \right) \end{matrix}$

-   -   c=2 is subtree 2. Here,         denotes bitwise OR. Y_(k,c)(i) is a random variable.     -   For c=0, where c=0 refers to the unpartitioned tree,         Y _(k,0)(I)=Y _(k,1)(i)         Y _(k,2)(i)  (Eqn 9)     -   Here Y_(k,1)(i)=1 if there exists a receiver in R_(k,1) which         receives the i-th probe (else 0). Similarly, Y_(k,2)(i)=1 if         there exists a receiver in R_(k,2) which receives the i-th probe         (else 0). Y_(k,0)(I)=1 if at least one of {R_(k,1), R_(k,2)}         contains such a receiver (else 0).         γ_(k,c)(i)=Pr[Y _(k,c)(i)=1], for cε{0, 1, 2}(Eqn 10)         Then, the values         _(k)(i) of may be calculated as:         _(k)(i)=Pr[x _(k)(i)]=γ_(k,0)(i),for kεR,  (Eqn 11)         where R is the set of receiver nodes.         Let U be the set of non-root nodes, then U\R is the set of         branch nodes (non-root, non-receiver). For kεU\R, the following         value is defined:

$\begin{matrix} {{\beta_{k,c}(i)} = {{\Pr\left\lbrack {{Y_{k,c}(i)} = \left. 1 \middle| {X_{k}(i)} \right.} \right\rbrack} = \frac{\gamma_{k,c}(i)}{{??}_{k}(i)}}} & \left( {{Eqn}\mspace{14mu} 12} \right) \end{matrix}$ Then, γ_(k,0)(i)=

_(k)(i)β_(k,0)(i)  (Eqn 13) γ_(k,0)(i)=

_(k)(i){1−(1−γ_(k,1)(i)/

_(k)(i)(1−γ_(k,2)(i)/

_(k)(i)}  (Eqn 14) Eqn 14 is linear in

_(k)(i) and can be solved:

$\begin{matrix} {{{??}_{k}(i)} = \frac{{\gamma_{k,1}(i)}{\gamma_{k,2}(i)}}{{\gamma_{k,1}(i)} + {\gamma_{k,2}(i)} - {\gamma_{k,0}(i)}}} & \left( {{Eqn}\mspace{14mu} 15} \right) \end{matrix}$ Summarizing Eqn 11 and Eqn 15:

$\begin{matrix} {{{{{??}_{k}(i)} = {\gamma_{k,0}(i)}},{{{for}\mspace{14mu} k} \in R}}{{{{??}_{k}(i)} = \frac{{\gamma_{k,1}(i)}{\gamma_{k,2}(i)}}{{\gamma_{k,1}(i)} + {\gamma_{k,2}(i)} - {\gamma_{k,0}(i)}}},{{{for}\mspace{14mu} k} \in {U/R}}}} & \left( {{Eqn}\mspace{14mu} 16} \right) \end{matrix}$

If the network comprises an arbitrary tree, in which a branch node may have more than two child nodes, the corresponding equation for

i_(k)(i) is a polynomial equation of order |d_(k)|−1, where |d|_(k) is the number of children of node k. In an example, the order of the equation may be reduced (for example, from quadratic to linear) by a more generalized subtree partitioning procedure. An example is shown in FIG. 6, which shows a schematic of an arbitrary tree T 600. As in the binary tree model above, probes are multicast from a source node S 602 to branch node node k 604. In this instance, branch node node k 604 has four child nodes, 610-616. In the subtree partitioning procedure, branch node node k 604 is configured as the root node for two subtrees, denoted T_(k,1) 606 and T_(k,2) 608. The union of T_(k,1) 606 and T_(k,2) 608 is denoted T_(k,0) 634, which is the entire subtree under node k 604. Each of the four child nodes 610-616 is then allocated to one of the subtrees. In general, child nodes are allocated to subtrees such that the population of child nodes in each subtree is approximately equal. In some instances, depending on the tree structure, an exactly equal number of child nodes in each subtree may not be achievable (for example, if there are an odd number of child nodes). Herein, “approximately equal” means that the number of child nodes in each subtree are as close to equal as the tree architecture permits in a specific instance. In this instance, child nodes 610 and 612 are allocated to subtree T_(k,1) 606, and child nodes 614 and 616 are allocated to subtree T_(k,2) 608. The child nodes are then indexed as node d_(1,1) 610, node d_(2,1) 612, node d_(1,2) 610, and node d_(1,2) 614. These child nodes then serve as branch nodes for leaf nodes. The leaf nodes in subtree T_(k,1) 606 are node R_(1,1) 618, node R_(2,1) 620, node R_(3,1) 622, and node R_(4,1) 624. Similarly, the leaf nodes in subtree T_(k,2) 608 are node R_(1,2) 626, node R_(2,2) 628, node R_(3,2) 630, and node R_(4,2) 632. The linear solutions for

_(k)(i) shown in Eqn 15 hold for arbitrary trees.

As discussed above, Eqn 15 apply for a single probe i. Another parameter of interest is the joint probability of a probe pattern I. In an example in which subtree partitioning is used, this parameter is calculated as follows.

$\begin{matrix} {{{Y_{k,c}(I)} = {\underset{h \in I}{⩓}{Y_{k,c}(h)}}},{{{for}{\mspace{11mu}\;}{the}\mspace{14mu}{two}\mspace{14mu}{subtrees}\mspace{14mu} c} = \left\{ {1,2} \right\}}} & \left( {{Eqn}\mspace{14mu} 17} \right) \end{matrix}$

Here

denotes bitwise AND. Y _(k,0)(I)=Y _(k,1)(I)

Y _(k,2)(I), where c=0  (Eqn 18)

refers to the unpartitioned tree.

Then, corresponding to Eqn 16 for the single probe i,

$\begin{matrix} {{{{{??}_{k}(I)} = {\gamma_{k,0}(I)}},{{{for}\mspace{14mu} k} \in R}}{{{{??}_{k}(I)} = \frac{{\gamma_{k,1}(I)}{\gamma_{k,2}(I)}}{{\gamma_{k,1}(I)} + {\gamma_{k,2}(I)} - {\gamma_{k,0}(I)}}},{{{for}\mspace{14mu} k} \in {U/R}},}} & \left( {{Eqn}\mspace{14mu} 19} \right) \end{matrix}$

If subtree partitioning is not used, then the values corresponding to Eqn. 12 are

$\begin{matrix} {{{\beta_{k,c}(I)} = {{\gamma_{k,c}(I)}/{{??}_{k}(I)}}},{{{for}\mspace{14mu} c} \in \left\{ {0,1,{\ldots\mspace{14mu}\left( {{d_{k}} - 1} \right)}} \right\}}} & \left( {{Eqn}\mspace{14mu} 20} \right) \\ {{\beta_{k,0}(I)} = {1 - {\prod\limits_{c = 1}^{{d_{k}} - 1}\;\left( {1 - {\beta_{k,c}(I)}} \right)}}} & \left( {{Eqn}\mspace{14mu} 21} \right) \end{matrix}$ The resulting equation for

_(k)(I) is not linear, but a polynomial of order |d_(k)|−1. Subtree partitioning is advantageous because Eqn 19 is linear.

In the subtree partitioning schemes described above, all probes in I passed through node k and reached receivers via nodes all within a single subtree. These schemes do not capture cases in which probes reach receivers for each index in I in a distributed way across the two subtrees, T_(k,1) and T_(k,2). In a further example of subtree partitioning, this limitation is removed, and

_(k)(I) may be derived from all trials which imply x_(k)(I).

In one example, for I={i, i+1}, and l, m, n, oε{0,1}:

$\begin{matrix} {\mspace{79mu}{{{??}_{k}\lbrack l\rbrack} = {\Pr\left\lbrack {{X_{k}(i)} = l} \right\rbrack}}} & \left( {{Eqn}\mspace{14mu} 22} \right) \\ {\mspace{79mu}{{{??}_{k}\lbrack{lm}\rbrack} = {\Pr\left\lbrack {{{X_{k}(i)} = l},{{X_{k}(i)} = {\left( {i + 1} \right) = m}}} \right\rbrack}}} & \left( {{Eqn}\mspace{14mu} 23} \right) \\ {\mspace{79mu}{{Y_{k,c}(i)} = {\underset{j \in R_{k,c}}{⩔}{X_{j}(i)}}}} & \left( {{Eqn}\mspace{14mu} 24} \right) \\ {\mspace{79mu}{{{\gamma_{k,c}(l)} = {\Pr\left\lbrack {Y_{k,c} = l} \right\rbrack}},{{{for}\mspace{14mu} c} = \left\{ {1,2} \right\}}}} & \left( {{Eqn}\mspace{14mu} 25} \right) \\ {\mspace{79mu}{{{\gamma_{k,c}\lbrack{lm}\rbrack} = {\Pr\left\lbrack {{{Y_{k,c}(i)} = l},{{Y_{k,c}\left( {i + 1} \right)} = m}} \right\rbrack}},{{{for}\mspace{14mu} c} = \left\{ {1,2} \right\}}}} & \left( {{Eqn}\mspace{14mu} 26} \right) \\ {{\gamma_{k}\left\lbrack {{lm},{no}} \right\rbrack} = {\Pr\left\lbrack {{{Y_{k,1}(i)} = l},{{Y_{k,1}\left( {i + 1} \right)} = m},{{Y_{k,2}(i)} = n},{{Y_{k,2}\left( {i + 1} \right)} = o}} \right\rbrack}} & \left( {{Eqn}\mspace{14mu} 27} \right) \\ {\mspace{79mu}{{{\beta_{k,c}(l)} = {\Pr\left\lbrack {{Y_{k,c}(i)} = \left. l \middle| {X(i)} \right.} \right\rbrack}},{{{for}\mspace{14mu} c} = \left\{ {1,2} \right\}}}} & \left( {{Eqn}\mspace{14mu} 28} \right) \\ {{{\beta_{k,c}({lm})} = {\Pr\left\lbrack {{{Y_{k,c}(i)} = l},{{Y_{k,c}\left( {i + 1} \right)} = \left. m \middle| {X(i)} \right.}} \right\rbrack}},{{{for}\mspace{14mu} c} = \left\{ {1,2} \right\}}} & \left( {{Eqn}\mspace{14mu} 29} \right) \\ {\mspace{79mu}{{\gamma_{k}\lbrack 11\rbrack} = {\Pr\left\lbrack {{{Y_{k}(i)} = 1},{{Y_{k}\left( {i + 1} \right)} = 1}} \right\rbrack}}} & \left( {{Eqn}\mspace{14mu} 30} \right) \end{matrix}$ Then trials which imply x_(k)(I) are γ_(k)[11]×γ_(k)[10,01]+γ_(k)[01,10]+γ_(k,1)[11]+  (Eqn 31) γ_(k,2)[11]−γ_(k)[11,11] where γ_(k)[10,01] and γ_(k)[01,10] capture those missed by Y_(k,0). From the conditional independence of the two trees,

$\begin{matrix} {{{\gamma_{k}\lbrack 11\rbrack} - {\gamma_{k,1}\lbrack 11\rbrack} - {\gamma_{k,2}\lbrack 11\rbrack}} = {{{\gamma_{k,}\left\lbrack {10,01} \right\rbrack} - {\gamma_{k,}\left\lbrack {01,10} \right\rbrack} - {\gamma_{k,}\left\lbrack {11,11} \right\rbrack}} = {{{??}_{k}\lbrack 11\rbrack}\left( {{{\beta_{k,1}\lbrack 10\rbrack}{\beta_{k,2}\lbrack 01\rbrack}} + {{\beta_{k,1}\lbrack 01\rbrack}{\beta_{k,2}\lbrack 10\rbrack}} + {{\beta_{k,1}\lbrack 11\rbrack}{\beta_{k,2}\lbrack 11\rbrack}}} \right)}}} & \left( {{Eqn}\mspace{14mu} 32} \right) \end{matrix}$ As before, γ_(k,c)[11]=

_(k)[11]β_(k,1)[11],for c={1,2}  (Eqn 33) therefore, γ_(k,c)[lm]=

_(k)[11]β_(k,c) [lm]+(

_(k)[1]−

_(k)[11])γ_(k,c)[1]/

_(k)[1]  (Eqn 34)

-   -   for [lm]=[01] or [10] and c={1, 2}         The β_(k,c)(lm) can now be eliminated in Eqn 34 and the         resulting quadratic equation for         _(k)[11] may be solved.

For the above tree and subtree partitioning schemes, estimators for parameters of interest may be derived. From n trials, samples of variables Y_(k,c)(I) are collected for each I of interest. Values of γ_(k,c)(I) may then be estimated using the empirical frequencies:

$\begin{matrix} {{{\hat{\gamma}}_{k,c}(I)} = \frac{\sum\limits_{i = 0}^{n - s - 1}\;{Y_{k,c}\left( {i + I} \right)}}{n - s - 1}} & \left( {{Eqn}\mspace{14mu} 35} \right) \end{matrix}$

where s=|I|

The values of {circumflex over (γ)}_(k,c)(I) are then used to define an estimator

_(k)(I) for

_(k)(i). In the case of subtree partitioning, this is done by substituting into the relevant equation for

_(k)(i). Otherwise, the unique root in [0,1] of the polynomial is found numerically. Another parameter of interest, the link joint passage probabilities, is estimated by

$\begin{matrix} {{{\hat{\alpha}}_{k}(I)} = \frac{{\hat{??}}_{k}(I)}{{\hat{??}}_{f{(k)}}(I)}} & \left( {{Eqn}\mspace{14mu} 36} \right) \end{matrix}$

The analysis above yields three categories of estimators, all of which work on arbitrary trees and arbitrary probe patterns I. These categories are defined herein. “General”, based on Eqn 21, applies to instances in which there is no subtree partitioning, and in which

_(k)(i) is solved numerically if the tree is non-binary. “Subtree”, based on Eqn 19, applies to instances in which there is subtree partitioning. “Advanced subtree”, based on Eqn 32, yields a quadratic in

_(k)(I) when using subtree partitioning.

In another embodiment, the parameter of interest is delay. In the examples discussed above, in which the parameter of interest was loss, the multicast process was characterized by node states and link processes. The node state X_(l)(i) indicated whether probe i had arrived at node l. There were only two values of node states. X_(l)(i)=1 if probe i arrives at node l; else 0. The link process Z_(l)(i) indicated whether link I was capable of transmission during the interval in which probe i would have attempted to reach node l, assuming that probe i had been present at the father node f(l). The link process Z_(l)(i) also had only two values. Z_(l)(i)=1 if link l is capable of transmission for probe i; else 0.

For delay, the multicast process is characterized by two processes. The delay measurement process X_(l)(i) records the delay along link l. The delay is the difference between the time at which probe i is transmitted from the father node f(l) of node l (assuming probe i has reached f(l) and the time at which it is received by node l. The link process Z_(l)(i) is the time delay process which determines the delay encountered by probe i during its transmission from f(l) to node l. In an embodiment, a series of probes, probe i, is transmitted from source node root node 0 to a receiver node node R. At receiver node node R, the total end-to-end path delay from source node root node 0 to node R is recorded. The aggregate data collected from a set of receiver nodes {node R} characterizes the set of end-to-end paths from source node root node 0 to each receiver node. MINC uses the aggregate data to infer temporal characteristics of delay processes determining the link processes Z_(l)={Z_(l)(i)} along individual links internal to the network. Examples of link delay processes include Bernoulli Scheme, Stationary Ergodic Semi-Markov Process, and Stationary Ergodic Semi-Markov Process of Order r.

In general, delay values are continuous values from 0 to ∞, (the value ∞ may be used to characterize a lost probe). In an embodiment, link delay values are measured as discrete values, which are an integer number of bins with a bin width of q. The set of delay values is then D={0,q,2q, . . . ,mq, ∞},  (Eqn 37)

-   -   where mq is a user-definable threshold value. Delays greater         than mq are declared to be lost, and the delays are set to ∞.         If q is normalized to 1 then the following set is defined:         ={0, 1, 2, . . . , m, ∞}.  (Eqn 38)         The discrete time discrete state delay process at link k is then         {Z_(k)(i)} and Z_(k)(i)ε         .

The delay measurement process at a node k is denoted {X _(k)(i)}:X _(k)(i)ε{0, 1, 2, . . . , ml(k),∞},  (Eqn 39)

-   -   where l(k) is the genealogical level with respect to root of         node k,     -   f^(l(k))=root.         For probe i, then,         X _(k)(i)=Z _(k)(i)+X _(f(k))(i)  (Eqn 40)         which states that the delay between root and node k is equal to         the delay between root and f(k) and the incremental delay         between f(k) and node k. The total delay from root to node k is         then the sum of the delay processes over all the ancestor nodes         of node k:

$\begin{matrix} {{{X_{k}(i)} = {\sum\limits_{j \in {a{(k)}}}\;{Z_{j}(i)}}},} & \left( {{Eqn}\mspace{14mu} 41} \right) \end{matrix}$

where a(k) is the set of ancestor nodes of node k.

In addition, the following probability results:

$\begin{matrix} {{\Pr\left\lbrack {{X_{k}(i)} = {\left. p \middle| {X_{f{(k)}}(i)} \right. = q}} \right\rbrack} = \left\{ \begin{matrix} 0 & {{{{for}\mspace{14mu} p} < q},} \\ 1 & {{{{for}\mspace{14mu} p} = {q = \infty}},} \\ {\Pr\left\lbrack {{Z_{k}(i)} = {p - q}} \right\rbrack} & {{otherwise}.} \end{matrix} \right.} & \left( {{Eqn}\mspace{14mu} 42} \right) \end{matrix}$ which states that if the delay from root to f(k) is the value q, then the probability that the delay from [root to node k]=p has three outcomes. If p<q, then the probability is obviously 0, otherwise the delay between f(k) and node k is negative (probe i arrives at node k before it arrives at f(k)). If q=∞, then the probability that p=∞ is obviously 1 since if probe i is lost at f(k) it continues to be lost at node k (probe i is not regenerated between f(k) and node k). Otherwise, the probability is the probability that the link delay process Z_(k)(i) has the value (p−q).

As in the example described above for a loss process, an embodiment for a delay process is applied to instances with the following dependence structure:

-   -   Spatial. Packet delay is independent across links.     -   Temporal. In previous applications of MINC, a delay process         within a single link is independent of time. In advantageous         procedures described herein, this constraint is removed, and a         larger range of network characteristics may be analyzed. A delay         process on any link is stationary and ergodic. That is, within a         link, delays may be correlated, with parameters that in general         depend on the link.

Packet delay on a specific network link is equal to the sum of a fixed delay and a variable delay. The fixed delay, for example, may be the minimum delay resulting from processing by network equipment (such as routers and switches) and transmission across physical links (such as fiber or metal cable). The minimum delay is characteristic of networks in which the traffic is low. As traffic increases, a variable delay is introduced. The variable delay, for example, may result from queues in buffers of routers and switches. It may also arise from re-routing of traffic during heavy congestion. In one procedure, delay is normalized by subtracting the fixed delay from the total delay. For example, for a specific link to a specific receiver, the fixed delay may be set equal to the minimum delay measured over a large number of samples at low traffic. If d_(max) is the maximum normalized delay measured over the set of receivers, then the threshold m for declaring a packet as lost, may for example, be set to m=d _(max) /q, where q is the bin width.  (Eqn 43)

A general goal is to estimate the complete family of joint probabilities Pr[Z _(k)(i ₁)=d ₁ ,Z _(k)(i ₂)=d ₂ , . . . ,Z _(k)(i _(s))=d _(s)]  (Eqn 44)

-   -   for any set s≧1 probe indices I={i₁, i₂, . . . i_(s)} and d₁,         d₂, . . . d_(s)ε         Principal values of interest are run distributions and mean run         lengths. Let L_(k) ^(H) denote a random variable which indicates         the length of runs of Z_(k) in a subset H, in which H satisfies         a set of user-defined parameters, of full state space         . Examples of H are given below. Then, the probability that         L_(k) ^(H) s greater than or equal to a value j is

$\begin{matrix} {{\Pr\left\lbrack {L_{k}^{H} \geq j} \right\rbrack} = \frac{\begin{matrix} {{\Pr\left\lbrack {{{Z_{k}(j)} \in H},\ldots\mspace{14mu},{{Z_{k}(1)} \in H}} \right\rbrack} -} \\ {\Pr\left\lbrack {{{Z_{k}(j)} \in H},\ldots\mspace{14mu},{{Z_{k}(0)} \in H}} \right\rbrack} \end{matrix}}{{\Pr\left\lbrack {{Z_{k}(1)} \in H} \right\rbrack} - {\Pr\left\lbrack {{{Z_{k}(0)} \in H},{{Z_{k}(1)} \in H}} \right\rbrack}}} & \left( {{Eqn}\mspace{14mu} 45} \right) \end{matrix}$ The mean run length is

$\begin{matrix} {\mu_{k}^{H} = {{E\left\lbrack L_{k}^{H} \right\rbrack} = \frac{\Pr\left\lbrack {{Z_{k}(j)} \in H} \right\rbrack}{{\Pr\left\lbrack {{Z_{k}(1)} \in H} \right\rbrack} - {\Pr\left\lbrack {{{Z_{k}(0)} \in H},{{Z_{k}(1)} \in H}} \right\rbrack}}}} & \left( {{Eqn}\mspace{14mu} 46} \right) \end{matrix}$

In Eqn 46, μ_(k) ^(H) is the ratio of the expected proportion of time spent in runs in the subset H (per unit time index) divided by the expected number of transitions into H (per unit time index). The mean run length of a delay state may be derived if the simplest joint probabilities with respect to that state may be estimated:

for a single probe, Pr[Z_(k)(i)εH],

for a successive pair of probes, Pr[Z_(k)(i)εH, Z_(k)(i+1)εH].

The tail probabilities of runs in H, Pr[L _(k) ^(H) ≧j] can be obtained from the joint probabilities of the state H for one, two, j, and j+1 probes.

Eqn 45 may be used to partition the link states into two classes. States in subset H are referred to as “bad”. States in

\H are referred to as “good”. For example, H may refer to states with a delay greater than a user-defined value d. In which case, μ_(k) ^(H) is the mean duration of runs in which the delay is at least d.

As in the procedure for estimating temporal loss characteristics, in an embodiment for estimating temporal delay characteristics, the source at the root node multicasts a stream of n probes, and each receiver records the end-to-end delays. The transmission of probes may then be viewed as an experiment with n trials. The outcome of the i-th trial is the set of discretized source-to-receiver delays {X _(k)(i),kεR},X _(k)(i)ε{0,1, . . . ,ml(k),∞}  (Eqn 47)

To calculate joint probabilities, the following values are defined herein. I={i ₁ ,i ₂ , . . . i _(s)}, as before I is a set of probe indexes,  (Eqn 48)

not necessarily contiguous X _(k)(I)=[X _(k)(i ₁),X _(k)(i ₂), . . . ,X _(k)(i _(s))] is a random vector  (Eqn 49) Z _(k)(I)=[Z _(k)(i ₁),Z _(k)(i ₂), . . . ,Z _(k)(i _(s))] is a random vector  (Eqn 50) D,V are delay vectors, and D≦V means d _(j)≦v_(j) for any j  (Eqn 51)

=[m,m, . . . m]  (Eqn 52) O=[0,0, . . . , 0]  (Eqn 53)

Then, the joint link probability is α_(k)(I,

)=Pr[

_(k)(I)=

],for

,

≧O,  (Eqn 54) and the joint passage probability is

$\begin{matrix} \begin{matrix} {{{{??}_{k}\left( {I,{??}} \right)} = {{{\Pr\left\lbrack {{{??}_{k}(I)} = {??}} \right\rbrack}\mspace{14mu}{for}\mspace{14mu}{??}} \leq {??}}},{{??} \leq {??}}} \\ {= {\sum\limits_{{??} \leq {??} \leq {??}}\;{{\alpha_{k}\left( {I,{??}} \right)}{{??}_{f{(k)}}\left( {{??} - {??}} \right)}}}} \end{matrix} & \left( {{Eqn}\mspace{14mu} 55} \right) \end{matrix}$

After the values

_(k)(I,

), for all kεU, for

≦

≦

, have been obtained, the following values are recursively deconvolved:

$\begin{matrix} {\mspace{79mu}{{{{For}\mspace{14mu}{??}} = {??}},\mspace{79mu}{{\alpha_{k}\left( {I,{??}} \right)} = \frac{{??}_{k}\left( {I,{??}} \right)}{{??}_{f{(k)}}\left( {I,{??}} \right)}}}} & \left( {{Eqn}\mspace{14mu} 56} \right) \\ {\mspace{79mu}{{{{For}\mspace{14mu}{??}} < {??} \leq {??}},{{\alpha_{k}\left( {I,{??}} \right)} = \frac{{{??}_{k}\left( {I,{??}} \right)} - {\sum\limits_{{??} < {??} \leq {??}}\;{{{??}_{f{(k)}}\left( {I,{??}} \right)}{\alpha_{k}\left( {I,{{??} - {??}}} \right)}}}}{{??}_{f{(k)}}\left( {I,{??}} \right)}}}} & \left( {{Eqn}\mspace{14mu} 57} \right) \end{matrix}$ For the case where

≦

does not hold (that is, at least one element of

is ∞), α_(k)(I,

) is obtained using α_(k)(I,

),

≦

, recursively using the α_(k) for smaller index sets. For example, for

=[d₁=∞, d₂, . . . , d_(s)], then α_(k)(I,

) may be re-expressed as follows:

$\begin{matrix} {{\alpha_{k}\left( {I,{??}} \right)} = {{\alpha_{k}\left( {\left\{ {i_{2},\ldots\mspace{14mu},i_{s}} \right\},\left\lbrack {d_{2},\ldots\mspace{14mu},d_{s}} \right\rbrack} \right)} - {\sum\limits_{v_{1} \leq m}\;{\alpha_{k}\left( {I,\left\lbrack {v_{1},d_{2},{\ldots\mspace{14mu} d_{s}}} \right\rbrack} \right)}}}} & \left( {{Eqn}\mspace{14mu} 58} \right) \end{matrix}$

For kεU, path probabilities

_(k)(I,

),

≦

≦

, are estimated by using the principle of subtree partition as follows. Consider branch node k 604 in the tree T 600 (FIG. 6). It is the root of the subtree T_(k,0) 634, which has receiver nodes R_(k,0) where R_(k,0) is the combined set of receiver nodes R_(1,1) 618 to R_(4,1) 624 and R_(1,2) 626 to R_(4,2) 632. The set of child subtrees of node k 604 are divided into two sets, corresponding to two virtual subtrees T_(k,1) 606 and T_(k,2) 608. Let j={0, 1, 2} be used to index quantities corresponding to subtrees T_(k,0) 634, T_(k,1) 606, and T_(k,2) 608, respectively. For a set of probe indices I, the following random vectors and probabilities are defined:

$\begin{matrix} {{{{Y_{k,j}(i)} = {\min\limits_{r \in R_{k,j}}{X_{r}(i)}}},{{{??}_{k,j}(I)} = \left\lbrack {{Y_{k,j}\left( i_{1} \right)},\ldots\mspace{14mu},{Y_{k,j}\left( i_{s} \right)}} \right\rbrack}}{{{\overset{\sim}{Y}}_{k,j}\left( {i,d} \right)} = \left\{ \begin{matrix} {{{1\mspace{14mu}{if}\mspace{14mu}{Y_{k,j}(i)}} - {X_{k}(i)}} \leq d} \\ {{{0\mspace{14mu}{if}\mspace{14mu}{Y_{k,j}(i)}} - {X_{k}(i)}} > d} \end{matrix} \right.}} & \left( {{Eqn}\mspace{14mu} 59} \right) \\ {{{{\overset{\sim}{??}}_{k,j}\left( {I,{??}} \right)} = \left\lbrack {{{\overset{\sim}{Y}}_{k,j}\left( {i_{1},d_{1}} \right)},\ldots\mspace{14mu},{{\overset{\sim}{Y}}_{k,j}\left( {i_{s},d_{s}} \right)}} \right\rbrack}{{\gamma_{k,j}\left( {I,{??}} \right)} = {\Pr\left\lbrack {{{??}_{k,j}(I)} \leq {??}} \right\rbrack}}} & \left( {{Eqn}\mspace{14mu} 60} \right) \\ {{\beta_{k,j}\left( {I,{??},{??}} \right)} = {\Pr\left\lbrack {{{\overset{\sim}{??}}_{k,j}\left( {I,{??}} \right)} = {??}} \right\rbrack}} & \left( {{Eqn}\mspace{14mu} 61} \right) \end{matrix}$ where

ε{0, 1}^(|I|). γ_(k,j)(I,

) is the probability that for each probe index i_(l)εI, the minimum delay on any path from source S to receivers in R_(k,j), does not exceed d_(l)ε

. On the other hand, β_(k,j)(I,

,

) is the probability that, for each probe index i_(l)εI, the minimum delay on any path from node k 604 to receivers in R_(k,j) is either ≦d_(l) or >d_(l)ε

, depending on whether b_(l)ε

is 1 or 0. Let

=[1, . . . , 1]. Then,

, β, and γ are related by the following convolution:

$\begin{matrix} {{\gamma_{k,j}\left( {I,{??}} \right)} = {\sum\limits_{{??} \leq {??} \leq {??}}\;{{{??}_{k}\left( {I,{??}} \right)}{\beta_{k,j}\left( {I,{{??} - {??}},} \right)}}}} & \left( {{Eqn}\mspace{14mu} 62} \right) \end{matrix}$ In order to recover

_(k) (I,

)'s from the γ_(k) (I,

)'s which are directly observable from receiver data, the following two properties of β's are used. Property 1. This property gives the relationship between β_(k,0) and {β_(k,1), β_(k,2)} of the virtual subtrees.

$\begin{matrix} {{\beta_{k,0}\left( {I,{??},} \right)} = {1 - {\prod\limits_{j = 1}^{2}\;\left( {1 - \left( {1 - {\beta_{k,j}\left( {I,{??},} \right)}} \right)}\quad \right.} + {1_{{I} > 1}\left( {\sum\limits_{\underset{{{s.t.\;{??}_{1}} ⩔ \;{??}_{2}} =}{\{{{{??}_{1} \neq},{{??}_{2} \neq}}\}}}\;{\prod\limits_{j = 1}^{2}\;{\beta_{k,j}\left( {I,{??},{??}_{j}} \right)}}} \right)}}} & \left( {{Eqn}\mspace{14mu} 63} \right) \end{matrix}$ Property 2. (Recursion over index sets with

=

) This property allows β_(k,j)(I,

,

≠

) to be expressed in terms of β_(k,j)(I′,

′,

′)'s, where I′

I. For instance, if

=[b₁=0, b₂, . . . , b_(s)], and I′={i₂, . . . , i_(s)},

=[b₂, . . . , b_(s)],

′=[d₂, . . . , d_(s)], then β_(k,j)(I,

′,

′)−β_(k,j)(I′,

′,

′) −β _(k,j)(I

, [1,b ₂ , . . . ,b _(s)]) which eliminates the 0 at i₁. The above can be applied recursively to eliminate all zeroes, resulting in terms of the form β_(k,j)(I′,

′,

), I′

I, |I|−z(

)≦|I′|≦|I|, where z(

) denotes the number of zeroes in

. In general β_(k,j)(I,

,

,

)=(−1)^(z(B))β_(k,j)(I,

,

)+δ _(k,j)(I,

,

)  (Eqn 64) where δ_(k,j)(I,

,

) is the appropriate summation of β_(k,j)'s for index sets I′⊂I. For example, if I={1, 2},

=[0, 1],

=[d₁, d₂], then, β_(k,j)(I,

,

)=−β_(k,j)(I,

,

)+β_(k,j)({2},[d ₂],

) Hence, δ_(k,j)(I,

,

)=β_(k,j)({2},[d ₂],

). By using Equation 64 in Equation 63, terms of the type

_(j)≠

can be removed, leaving only terms of type

_(j)=

, giving:

$\begin{matrix} {{\beta_{k,0}\left( {I,{??},} \right)} = {1 - {\prod\limits_{j = 1}^{2}\;\left( {1 - {\beta_{k,j}\left( {I,{??},} \right)}} \right)} + {1_{{I} > 1}\left( {\sum\limits_{\underset{{{s.t.\;{??}_{1}} ⩔ \;{??}_{2}} =}{\{{{{??}_{1} \neq},{{??}_{2} \neq}}\}}}\;{\prod\limits_{j = 1}^{2}\;\left\{ {{\left( {- 1} \right)^{({??})}{\beta_{k,j}\left( {I,{??},} \right)}} + {\delta_{k,j}\left( {I,{??},{??}} \right)}} \right\}}} \right)}}} & \left( {{Eqn}\mspace{14mu} 65} \right) \end{matrix}$ Using Equation 65 and Equation 62, the desired path probabilities for node k 604,

_(k)(I,

), O≦D≦

, can be computed using the observables γ_(k,j)(I,

). The recovery of

_(k)(I,

) from the above equations involves two levels of recursion: (i) over delay vectors, arising due to convolution, (ii) over index sets arising due to summation term involving δ in Equation 65. The δ(I, .,.) only contains terms involving I′⊂I and therefore does not contain

_(k)(I, .). Thus estimation can be performed recursively starting from I={i} when the summation term with δ vanishes and

=

when the convolution vanishes. Each step of recursion involves solving a quadratic equation in the unknown

_(k).

The computation of

_(k)(I,

) for pairs of consecutive probes i.e. I={1, 2}, proceeds as follows (I={1, 2} is same as I={i, i+1}). Due to recursion over index sets, the case of I={1} is considered first.

Single probes I={1}: The base case of recursion occurs for I={i} and

=[0]. To simplify notation, the following are dropped: the index set I,

=

, and vector notation for delays. For example, β_(k,j)(I, [d₁],

)=β_(k,j)(d₁). Writing out Equation 65 and Equation 62, γ_(k,j)(0)=

_(k)(0)β_(k,j)(0) β_(k,0)(0)=1−(1−β_(k,1)(0))(1−β_(k,2)(0))  (Eqn 66) from which

_(k)(0) is recovered by solving a linear equation as

${{??}_{k}(0)} = \frac{{\gamma_{k,1}(0)}{\gamma_{k,2}(0)}}{{\gamma_{k,1}(0)} + {\gamma_{k,2}(0)} - {\gamma_{k,0}(0)}}$ Substituting back

_(k)(0) gives the β_(k,j)(0)'s for use in the next step. Assuming that

_(k) and β_(k,j)'s have been computed ∀v₁<d₁,

_(k)(d₁) is recovered using Equation 65 and Equation 62 as

${\gamma_{k,j}\left( d_{1} \right)} = {{{{??}_{k}(0)}{\underset{*}{\beta_{k,j}}\left( d_{1} \right)}} + {\underset{*}{{??}_{k}\left( d_{1} \right)}{\beta_{k,j}(0)}} + {\sum\limits_{0 < v_{1} < d_{1}}\;{{{??}_{k}\left( v_{1} \right)}{\beta_{k,j}\left( {d_{1} - v_{1}} \right)}}}}$ $\mspace{20mu}{\underset{*}{\beta_{k,0}\left( d_{1} \right)} = {1 - {\left( {1 - \underset{*}{\beta_{k,1}\left( d_{1} \right)}} \right)\left( {1 - \underset{*}{\beta_{k,2}\left( d_{1} \right)}} \right)}}}$ The unknown terms are marked by a “*”.

_(k)(d₁) is recovered by solving a quadratic equation and substituting back

_(k)(d₁) gives β_(k,j)(d₁)'s. Pairs of consecutive probes I={1, 2}: Again, to simplify the notation, the following are dropped: the index set I,

=

, and vector notation for delays. For example, β_(k,j)(I, [d₁, d₂],

)=β_(k,j)(d₁, d₂). The estimation proceeds from delay vector [0, 0] until [m, m]. Assuming that

_(k) and β_(j)'s have been computed for the set {[v ₁ ,v ₂ ]:v ₁ ≦d ₁ ,v ₂ ≦d ₂ }\{[d ₁ ,d ₂]},

_(k)(d₁, d₂) is recovered as follows. Equation 65 and Equation 62 are expanded.

$\begin{matrix} {{{\gamma_{k,j}\left( {d_{1},d_{2}} \right)} = {{{{??}_{k}\left( {0,0} \right)}\underset{*}{\beta_{k,j}\left( {d_{1},d_{2}} \right)}} + {\underset{*}{{??}_{k}\left( {d_{1},d_{2}} \right)}{\beta_{k,j}\left( {0,0} \right)}} + {\underset{{{({v_{1},v_{2}})} \neq {({0,0})}},{{({v_{1},v_{2}})} \neq {({d_{1},d_{2}})}}}{\sum\limits_{v_{1} \leq d_{1}}\;\sum\limits_{v_{2} \leq d_{2}}}\;{{??}_{k}\left( {v_{1},v_{2}} \right)}{\beta_{k,j}\left( {{d_{1} - v_{1}},{d_{2} - v_{2}}} \right)}}}}{\underset{*}{\beta_{k,0}\left( {d_{1},d_{2}} \right)} = {1 - {\left( {1 - \underset{*}{\beta_{k,1}\left( {d_{1},d_{2}} \right)}} \right)\left( {1 - \underset{*}{\beta_{k,2}\left( {d_{1},d_{2}} \right)}} \right)} + {\left( {{- \underset{*}{\beta_{k,1}\left( {d_{1},d_{2}} \right)}} + {\beta_{k,1}\left( d_{2} \right)}} \right)\left( {{- \underset{*}{\beta_{k,2}\left( {d_{1},d_{2}} \right)}} + {\beta_{k,2}\left( d_{1} \right)}} \right)} + {\left( {{- \underset{*}{\beta_{k,1}\left( {d_{1},d_{2}} \right)}} + {\beta_{k,1}\left( d_{1} \right)}} \right)\left( {{- \underset{*}{\beta_{k,2}\left( {d_{1},d_{2}} \right)}} + {\beta_{k,2}\left( d_{2} \right)}} \right)}}}} & \left( {{Eqn}\mspace{14mu} 67} \right) \end{matrix}$ The unknown terms are marked by a “*” and

_(k)(d₁, d₂) is obtained by solving a quadratic equation.

The parameter γ_(k,j)(I,

) may be estimated using the empirical frequencies as:

γ ^ k , j ⁡ ( I , ?? ) = ∑ i = 0 n -  I  - 1 ⁢ ⁢ ?? k , j ⁡ ( i + I ) ≤ ?? n -  I  - 1 ( Eqn ⁢ ⁢ 68 ) The parameter γ_(k,j)(I,

) is then used to define an estimator

(I,

) for

_(k)(I,

). The parameter {circumflex over (α)}_(k)(I,

) is then recursively deconvolved. The mean run length of delay state pε

is estimated using joint probabilities of single and two packet indices as

$\begin{matrix} {{\hat{\mu}}_{k}^{p} = \frac{{\hat{\alpha}}_{k}(p)}{{{\hat{\alpha}}_{k}(p)} - {{\hat{\alpha}}_{k}\left( {p,p} \right)}}} & \left( {{Eqn}\mspace{14mu} 69} \right) \end{matrix}$

where α_(k)(p)=α_(k)({i₁}, [p]) and α_(k)(p,p)=α_(k)({i₁, i₂}, [p,p])

When delay states are classified into bad H and good G=

\H states, the mean run length of bad state is estimated using the joint probabilities of single and two packet indices as:

$\begin{matrix} {{\hat{\mu}}_{k}^{H} = \frac{\sum\limits_{p \in H}\;{{\hat{\alpha}}_{k}(p)}}{{\sum\limits_{p \in H}\;{{\hat{\alpha}}_{k}(p)}} - {\sum\limits_{p_{1} \in H}\;{\sum\limits_{p_{2} \in H}\;{{\hat{\alpha}}_{k}\left( {p_{1},p_{2}} \right)}}}}} & \left( {{Eqn}\mspace{14mu} 70} \right) \end{matrix}$ A similar expression is used to estimate {circumflex over (μ)}_(k) ^(G).

One embodiment of a network characterization system which performs multicast-based inference may be implemented using a computer. As shown in FIG. 7, computer 702 may be any type of well-known computer comprising a central processing unit (CPU) 706, memory 704, data storage 708, and user input/output interface 710. Data storage 708 may comprise a hard drive or non-volatile memory. User input/output interface 710 may comprise a connection to a user input device 722, such as a keyboard or mouse. As is well known, a computer operates under control of computer software which defines the overall operation of the computer and applications. CPU 706 controls the overall operation of the computer and applications by executing computer program instructions which define the overall operation and applications. The computer program instructions may be stored in data storage 708 and loaded into memory 704 when execution of the program instructions is desired. Computer 702 may further comprise a signal interface 712 and a video display interface 716. Signal interface 712 may transform incoming signals, such as from a network analyzer, to signals capable of being processed by CPU 706. Video display interface 716 may transform signals from CPU 706 to signals which may drive video display 720. Computer 702 may further comprise one or more network interfaces. For example, communications network interface 714 may comprise a connection to an Internet Protocol (IP) communications network 726, which may transport user traffic. In one embodiment, the network characterization system further comprises nodes within communications network 726. These nodes may serve as a source node and a set of receiver nodes. As another example, test network interface 718 may comprise a connection to an IP test network 724, which may transport dedicated test traffic. Computer 702 may further comprise multiple communications network interfaces and multiple test network interfaces. In some instances, the communications network 726 and the test network 724 may be the same. Computers are well known in the art and will not be described in detail herein.

The foregoing Detailed Description is to be understood as being in every respect illustrative and exemplary, but not restrictive, and the scope of the invention disclosed herein is not to be determined from the Detailed Description, but rather from the claims as interpreted according to the full breadth permitted by the patent laws. It is to be understood that the embodiments shown and described herein are only illustrative of the principles of the present invention and that various modifications may be implemented by those skilled in the art without departing from the scope and spirit of the invention. Those skilled in the art could implement various other feature combinations without departing from the scope and spirit of the invention. 

The invention claimed is:
 1. A method for characterizing a packet data network comprising a source node, a plurality of receiver nodes, and a plurality of paths, paths in the plurality of paths connecting the source node with respective ones of the plurality of receiver nodes, the paths comprising respective sets of links, the method comprising: recording at respective ones of the plurality of receiver nodes arrivals of a plurality of multicast probe messages transmitted from the source node; and calculating, by a processor in communication with a data storage device, a probability that a length of a pass-run or a length of a loss-run exceeds a value over a selected time interval for a respective link in the set of links for a respective path in the plurality of paths by inference from the arrivals of the plurality of multicast probe messages.
 2. The method of claim 1 wherein the selected time interval is non-contiguous.
 3. The method of claim 1 wherein a topology of the packet data network is a binary tree and the binary tree is partitioned into two subtrees.
 4. The method of claim 1 wherein a topology of the packet data network is an arbitrary tree and the arbitrary tree is partitioned into two subtrees.
 5. The method of claim 4 further comprising calculating a joint probability of concurrent probe message paths within the two subtrees.
 6. An apparatus for characterizing a packet data network comprising a source node, a plurality of receiver nodes, and a plurality of paths, paths in the plurality of paths connecting the source node with respective ones of the plurality of receiver nodes, the paths comprising a respective plurality of links, the apparatus comprising: a data storage device storing computer program instructions; and a processor in communication with the data storage device, the processor to execute the computer program instructions to cause the processor to perform operations comprising: recording at respective ones of the plurality of receiver nodes arrivals of a plurality of multicast probe messages transmitted from the source node; and calculating a probability that a length of a pass-run or a length of a loss-run exceeds a value over a selected time interval for a respective link in the plurality of links for a respective path in the plurality of paths by inference from the recorded arrivals.
 7. The apparatus of claim 6 wherein the selected time interval is non-contiguous.
 8. The apparatus of claim 6 wherein a topology of the packet data network is a binary tree and the operations further comprise partitioning the binary tree into two subtrees.
 9. The apparatus of claim 6 wherein a topology of the packet data network is an arbitrary tree and the operations further comprise partitioning the arbitrary tree into two subtrees.
 10. The apparatus of claim 9 wherein the operations further comprise calculating a joint probability of concurrent probe message paths within the two subtrees.
 11. A computer readable storage device comprising computer program instructions for characterizing a packet data network comprising a source node, a plurality of receiver nodes, and a plurality of paths, paths in the plurality of paths connecting the source node with respective ones of the plurality of receiver nodes, the paths comprising respective sets of links, the instructions, when executed on a processor, to cause the processor to perform operations comprising: recording at respective ones of the plurality of receiver nodes arrivals of a plurality of multicast probe messages transmitted from the source node; and calculating a probability that a length of a pass-run or a length of a loss-run exceeds a value over a selected time interval for a respective link in the set of links for a respective path in the plurality of paths by inference from the recorded arrivals.
 12. The computer readable storage device of claim 11 wherein the selected time interval is non-contiguous.
 13. The computer readable storage device of claim 11 wherein a topology of the packet data network is a binary tree and the operations further comprise partitioning the binary tree into two subtrees.
 14. The computer readable storage device of claim 11 wherein a topology of the packet data network is an arbitrary tree and the operations further comprise partitioning the arbitrary tree into two subtrees.
 15. The computer readable storage device of claim 14 wherein the operations further comprise calculating a joint probability of concurrent probe message paths within the two subtrees. 